Inclusion Problems in Parallel Learning and Games
نویسندگان
چکیده
منابع مشابه
Static prediction games for adversarial learning problems
The standard assumption of identically distributed training and test data is violated when the test data are generated in response to the presence of a predictive model. This becomes apparent, for example, in the context of email spam filtering. Here, email service providers employ spam filters and spam senders engineer campaign templates such as to achieve a high rate of successful deliveries ...
متن کاملLearning about Recycling and Reuse through Pre-School Games
Learning about Recycling and Reuse through Pre-School Games S.M. Shobeyri, Ph.D. H. Meybodi A. Saraadipoor S. Rashidi Environmental education is the most fundamental approach to environmental protection and can begin from the pre-school level and through the use of games. To show the effectiveness of this approach, a random sample of 30 preschoolers of ages 5 and 6 was se...
متن کاملInclusion Problems in Trace Monoids
We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to problems of recognizing frequent patterns ...
متن کاملMarkov Security Games: Learning in Spatial Security Problems
In this paper we present a preliminary investigation of modelling spatial aspects of security games within the context of Markov games. Reinforcement learning is a powerful tool for adaptation in unknown environments, however the basic singleagent RL algorithms are unfit to be applied in adversarial scenarios. Therefore, we profit from Adversarial Multi-Armed Bandit (AMAB) methods which are des...
متن کاملTree inclusion problems
Given two trees (a target T and a pattern P ) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjace...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0031